Optimization of Individual and Regulatory Market Strategies with Genetic Algorithms

نویسندگان

  • Lukáš Pichl
  • Ayako Watanabe
چکیده

An optimal policy problem is formulated for evolutionary market settings and analyzed in two applications at the microand macrolevels. First, individual portfolio policy is studied in case of a fully computerized, multiagent market system. We clarify the conditions under which static approaches—such as constraint optimization with stochastic rates or stochastic programming—apply in coevolutionary markets with strictly maximal players under scaled genetic algorithms. Convergence to global optimum is discussed for (a) coevolution of buying and selling strategies and for (b) coevolution of portfolio strategies and asset distributions over market players. Because only a finite population size in our setting suffices for the asymptotic convergence, the design criteria for genetic algorithm given (explicit cooling scheme for mutation and crossover, exponentiation schedule for fitness-selection) are of practical importance. IDEA GROUP PUBLISHING This chapter appears in the book, Computational Economics: A Perspective from Computational Intelligence edited by Shu-Heng Chen, Lakhmi Jain & Chung-Ching Tai © 2006, Idea Group Inc. 701 E. Chocolate Avenue, Suite 200, Hershey PA 17033-1240, USA Tel: 717/533-8845; Fax 717/533-8661; URL-http://www.idea-group.com ITB11863 100 Pichl & Watanabe Copyright © 2006, Idea Group Inc. Copying or distributing in print or electronic forms without written permission of Idea Group Inc. is prohibited. Second, system optimization policy is studied for a model economy of Kareken and Wallace (1982) type. The income redistribution, monetary and market regulation policies are subjected to a supergenetic algorithm with various objective functions. In particular, the fitness function of a policy (i.e., a supercreature) is computed by means of a conventional genetic algorithm which is applied to the market players (creatures) in a fixed evaluation period. Here, the underlying genetic algorithm drives the infinite market dynamics and the supergenetic algorithm solves the optimal policy problem. Coevolution of consumption and foreign currency saving policies is discussed. Finally, a Java model of a stationary market was developed and made available for use and download. INTRODUCTION Evolutionary market models are a useful tool to investigate properties of real markets. This work deals with applications of the genetic algorithm (GA) in simulated agent-based artificial markets at microand macrolevels from methodological viewpoint. GA applications to agent’s portfolio optimization problem (micro) and market/society optimization problem (macro) are discussed in the context of coevolution. The microlevel problem of choosing optimal portfolio has been intensively studied since the pioneering works on portfolio optimization Markowitz (1952) and Tobin (1958) by financial investment companies and in academia (cf. Markowitz, 1991; Michaud, 1998). The first research direction is based on phenomenological studies, statistics and data mining applied to aggregate data from asset markets and their derivatives. The second line of investigation is based on computerized bottom-up techniques, starting with behavioral models at the microlevel, implementing market information models, and the price-making mechanism. This yields complete data time series both at the microand macrolevels. Although macroscale simulation results are a subject to comparison with real markets, microscale simulation output data offer insight into the market dynamics and its underlying mechanisms. This work first deals with the portfolio optimization problem in closed simulated markets, in which total finance m and nominal amounts of all kinds of stock, 1 i q i n , = ,... , are constant; price matching is a deterministic algorithm adjusted to imperfect information condition by using time series of closed auctions. In particular, we adopt the common market model by Yuuki, Moriya, Yoshida and Pichl (see Figure 1). In the YMYP model, the self-contained market is further coupled to the external world through stochastic time series of dividend yields per each stock simulating data from actual markets. In this framework, the time series of stock prices and traded volumes result from the actions taken by each agent: keep, buy, or sell. In addition, we consider an alternative noncorrelated investment asset d with a fixed yield rate r. Hence the portfolio is a tuple of { } i m d q , , which is recursively evaluated in discrete steps (market sessions). The portfolio is to be optimized with respect to a certain utility function. If the market initial state is set and the agents behavioral rules are fixed, each agent/portfolio holder optimizes the function of n–1 variables, which is computed by fully deterministic algorithm A consisting of a set of agent behavioral rules and the price making mechanism. Either A is ex ante known to each dealer (shared theory) or A is generally unknown (individual behavioral rules). In the latter case, A can be studied ex post by data mining 17 more pages are available in the full version of this document, which may be purchased using the "Add to Cart" button on the product's webpage: www.igi-global.com/chapter/optimization-individualregulatory-market-strategies/6782?camid=4v1 This title is available in InfoSci-Books, Business Intelligence, Business-Technology-Solution, InfoSci-Business Technologies, Business, Administration, and Management, InfoSci-Business. Recommend this product to your librarian: www.igi-global.com/e-resources/libraryrecommendation/?id=1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators

With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...

متن کامل

Comparison of Portfolio Optimization for Investors at Different Levels of Investors' Risk Aversion in Tehran Stock Exchange with Meta-Heuristic Algorithms

The gaining returns in line with risks is always a major concern for market play-ers. This study compared the selection of stock portfolios based on the strategy of buying and retaining winning stocks and the purchase strategy based on the level of investment risks. In this study, the two-step optimization algorithms NSGA-II and SPEA-II were used to optimize the stock portfolios. In order to de...

متن کامل

Gradient-based Ant Colony Optimization for Continuous Spaces

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

متن کامل

Optimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm

In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...

متن کامل

COMPARATIVE COSTS OF THE PRODUCTION, TRANSPORT AND ASSEMBLY STAGES OF PRESTRESSED PRECAST SLABS USING GENETIC ALGORITHMS

In the precast structures, optimization of structural elements is of great interest mainly due to a more rationalized way that elements are produced. There are several elements of precast prestressed concrete that are objects of study in optimization processes, as the prestressed joist applied in buildings slabs. This article inquires into cost minimization of continuous and simply supported sl...

متن کامل

Gradient-based Ant Colony Optimization for Continuous Spaces

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015